Adequacy of decompositions of relational databases
نویسندگان
چکیده
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملConverting Relational Databases into Object-relational Databases
ion (abs): A super-class is abstract (i.e., abs := true) when all of its objects are members of its sub-type objects. Instances of an abstract type cannot appear in the database extension, but are subsumed into instances of its sub-types. Attributes (Acdm): A class C has a set of attributes Acdm. Acdm := {a | a := 〈an, t, tag, l, n, d〉}, where each attribute a has a name an, data type t and a t...
متن کاملPersistent Watermarking of Relational Databases
Digital watermarking for relational databases emerged as a candidate solution to provide copyright protection of relational data, maintaining integrity of the database information, tamper detection, traitor tracing etc. In this paper, we introduce the notion of persistent watermarking that serves as a way to recognize the integrity and ownership proof of the database bounded with a set of queri...
متن کاملAutomating Layout of Relational Databases
The choice of database layout, i.e., how database objects such as tables and indexes are assigned to disk drives can significantly impact the I/O performance of the system. Today, DBAs typically rely on fully striping objects across all available disk drives as the basic mechanism for optimizing I/O performance. While full striping maximizes I/O parallelism, when query execution involves co-acc...
متن کاملIncremental Reorganization of Relational Databases
The evolution of an information system is reflected in Abstract data modeling by database reorganization. Entity-Relationship consistency expresses the capability of relational databases to model information oriented systems. A relational schema consisting of &ation schemes. together with key and inclusion dependencies, is said to be ER-consistent if it complies with an entity-relationship stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1980
ISSN: 0022-0000
DOI: 10.1016/0022-0000(80)90029-x